Spectra of Monadic Second-Order Formulas with One Unary Function
نویسندگان
چکیده
We establish the eventual periodicity of the spectrum of any monadic second-order formula where (i) all relation symbols, except equality, are unary, and (ii) there is only one function symbol and that symbol is unary. Eighteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2003) Microsoft Research, One Microsoft Way, Redmond, WA 98052 Publication 536, partially supported by US–Israel Binational Science Foundation. Institute of Mathematics, Hebrew University of Jerusalem, Givat Ram, 91904 Jerusalem, Israel, and Mathematics Department, Rutgers University, New Brunswick, NJ 08903, U.S.A.
منابع مشابه
On spectra of sentences of monadic second order logic with counting
We show that the spectrum of a sentence φ in Counting Monadic Second Order Logic (CMSOL) using one binary relation symbol and finitely many unary relation symbols, is ultimately periodic, provided all the models of φ are of clique width at most k, for some fixed k. We prove a similar statement for arbitrary finite relational vocabularies τ and a variant of clique width for τ structures. This in...
متن کاملOperations on Relational Structures and Their Compatibility with Monadic Second Order Logic
Relational structures ooer a common framework to handle graphs and hy-pergraphs of various kinds. Operations like disjoint union, creation of new relations, relabellings of relations make it possible to denote them by algebraic expressions. We consider operations such that every Monadic Second-Order expressible property can be veriied eeciently on the expression denoting the considered structur...
متن کاملMonadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-width and clique-width. It will review applications to the construction of algorithms, to Graph Theory and to the extension to graphs of Formal Language Theory concepts. We first explain the role of Logic. A graph, eith...
متن کاملGraph Connectivity and Monadic NP
Ehrenfeucht games are a useful tool an proving that certain properties of finite structures are not expressible by formulas of a certain type. In this paper a new method is introduced that allows the extension of a local winning strategy for Duplicator, one of the two players in Ehrenfeucht games, to a global winning strategy. As an application i t i s shown that Graph Connectivity cannot be ex...
متن کاملMonadic Second-Order Unification Is NP-Complete
Monadic Second-Order Unification (MSOU) is Second-Order Unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding whether a set of monadic equations has a unifier is NP-complete. We also prove that Monadic Second-Order Matching is also NP-complete.
متن کامل